On strong normalization of explicit substitution calculi
نویسندگان
چکیده
We present a counterexample to the strong normalization—also called termination—of the underlying calculus of explicit substitution of λτ . This problem was open.
منابع مشابه
Calculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions
Extending the λ-calculus with either explicit substitution or generalized reduction has been the subject of extensive research recently, and still has many open problems. This paper is the first investigation into the properties of a calculus combining both generalized reduction and explicit substitutions. We present a calculus, λgs, that combines a calculus of explicit substitution, λs, and a ...
متن کاملFrom to a Journey through Calculi of Explicit Substitutions
This paper gives a systematic description of several calculi of explicit substitutions. These systems are orthogonal and have easy proofs of termination of their substitution calculus. The last system, called , entails a very simple environment machine for strong normalization of-terms.
متن کاملSwapping: a natural bridge between named and indexed explicit substitution calculi
This article is devoted to the presentation of λ rex, an explicit substitution calculus with de Bruijn indexes and a simple notation. By being isomorphic to λex – a recent formalism with variable names –, λ rex accomplishes simulation of β -reduction (Sim), preservation of β -strong normalization (PSN) and meta-confluence (MC), among other desirable properties. Our calculus is based on a novel ...
متن کاملSimple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The method is first illustrated by applying to a composition-free calculus of explicit substitutions, yielding a simpler proof than the previous one by Lengrand et al. Then we present a new intersection type system in the s...
متن کاملExplicit substitutions for control operators ?
The-calculus is a-calculus with a local operator closely related to normal-isation procedures in classical logic and control operators in functional programming. We introduce exp, an explicit substitution calculus for , show it preserves strong normali-sation and that its simply typed version is strongly normalising. Interestingly, exp is the rst example for which the decency method of showing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000